Marker versus Inkdot on Four-Dimensional Tapes

نویسندگان

  • YASUO UCHIDA
  • MAKOTO SAKAMOTO
  • RYOJU KATAMUNE
  • KAZUYUKI UCHIDA
  • HIROSHI FURUTANI
  • MICHIO KONO
  • SATOSHI IKEDA
چکیده

A multi-marker automaton is a finite automaton which keeps marks as pebbles in the finite control, and cannot rewrite any input symbols but can make marks on its input with the restriction that only a bounded number of these marks can exist at any given time. An improvement of picture recognizability of the finite automaton is the reason why the multi-marker automaton was introduced. On the other hand, a multi-inkdot automaton is a conventional automaton capable of dropping an inkdot on a given input tape for a landmark, but unable to further pick it up. Due to the advances in many application areas such as moving image processing, computer animation, and so on, it has become increasingly apparent that the study of four-dimensional pattern processing has been of crucial importance. Thus, we think that the study of four-dimensional automata as a computational model of four-dimensional pattern processing has also been meaningful. This paper deals with marker versus inkdot over four-dimensional input tapes, and investigates some properties. Key–Words: finite automaton, four-dimension, inkdot, marker, recognizability

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inkdot versus Pebble over Two-Dimensional Languages

This paper investigates a relationship between inkdot and one-pebble for two-dimensional finite automata (2-fa’s). Especially we show that (1) alternating inkdot 2-fa’s are more powerful than nondeterministic one-pebble 2-fa’s, and (2) there is a set accepted by an alternating inkdot 2-fa, but not accepted by any alternating one-pebble 2-fa with only universal states. key words: inkdot, pebble,...

متن کامل

Some Observations on 1-Inkdot Alternating Multi-Counter Automata with Sublinear Space

This paper investigates some fundamental properties of 2-way alternating multi-counter automata (2amca’s) with only existential (universal) states which have sublinear space and 1 inkdot. It is shown that for any function s(n) ≥ log n such that log s(n) = o(log n), s(n) space-bounded 1-inkdot 2amca’s with only existential states are incomparable with the ones with only universal states, and the...

متن کامل

Consideration on the Recognizability of Three-Dimensional Patterns

Due to the advances in computer vision, robotics, and so forth, it has become increasingly apparent that the study of three-dimensional pattern processing should be very important. Thus, the study of three-dimensional automata as the computational model of three-dimensional information processing has been significant. During the past about thirty years, automata on a three-dimensional tape have...

متن کامل

Effect of Twisted Tape Baffles on Pressure Drop, Fluctuation and Expansion Ratios in gas - Solid Fluidized Bed

In the present work an attempt has been made to study the effect of the twisted tapes as bed internals, on the performance of the gas-solid fluidized beds. Experimental investigation has been carried out in cylindrical column with and without twisted tapes. Twelve numbers of twisted tapes of three different widths with four values of the twist ratios for each width were studied at different...

متن کامل

Two Heads are Better than Two

We show that a Turing machine with two single-head one-dimensional tapes cannot recognize the set f x2x 0 j x 2 f0;1g and x 0 is a preex of x g in real time, although it can do so with three tapes, two two-dimensional tapes, or one two-head tape, or in linear time with just one tape. In particular, this settles the longstanding conjecture that a two-head Turing machine can recognize more langua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010